A Bus Transport Network Model Based On Directed Random Walk
نویسندگان
چکیده
On the basis of the analysis of the statistical data of bus transport networks of three major cities in China, we propose a novel evolution model of the bus transport network, which applies the strategy of random walk based on direction constrain matrix on two-dimensional grid and the mechanism of combining the geographical-close stations. We investigate some static properties, which include the topological structure and the spatial characteristics covering the neighboured road sections directions and the road section length distribution, and study the dynamic characteristic of the network traffic flow distribution analysed by the method of minimum spanning tree. The simulation results show that the statistical features of the model agree well with that of the actual networks. Key-Words: bus transport network model, directed random walk, combining the geographical-close stations, direction constrain matrix
منابع مشابه
Probit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach
Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...
متن کاملTracking performance of incremental LMS algorithm over adaptive distributed sensor networks
in this paper we focus on the tracking performance of incremental adaptive LMS algorithm in an adaptive network. For this reason we consider the unknown weight vector to be a time varying sequence. First we analyze the performance of network in tracking a time varying weight vector and then we explain the estimation of Rayleigh fading channel through a random walk model. Closed form relations a...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملطراحی یک مدل یادگیری تمیزدهنده جهت بهبود مسیرهای اتوبوس در شبکهی حمل و نقل بهینه
Design a Bus Transit Network is an important problem of the Urban Management. There are a large number of variables that must be considered to design a bus transit network. These variables are used to reach a set of goals such as accessibility, maximum coverage, reduction of waiting time and decrease operational costs and number of transfer between line stops. Design a Bus Transit Network is NP...
متن کاملRandom Walks on Directed Covers of Graphs
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still equals the branching number, upper and lower growth rates do not longer coincide in general. Furthermore, the behaviour of random walks on directed covers of infi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014